Fast Basins and Branched Fractal Manifolds of Attractors of Iterated Function Systems

نویسنده

  • Michael F. BARNSLEY
چکیده

The fast basin of an attractor of an iterated function system (IFS) is the set of points in the domain of the IFS whose orbits under the associated semigroup intersect the attractor. Fast basins can have non-integer dimension and comprise a class of deterministic fractal sets. The relationship between the basin and the fast basin of a point-fibred attractor is analyzed. To better understand the topology and geometry of fast basins, and because of analogies with analytic continuation, branched fractal manifolds are introduced. A branched fractal manifold is a metric space constructed from the extended code space of a point-fibred attractor, by identifying some addresses. Typically, a branched fractal manifold is a union of a nondenumerable collection of nonhomeomorphic objects, isometric copies of generalized fractal blowups of the attractor.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete Iterated Function Systems

discrete iterated function systems discrete iterated function systems representation of discrete sequences with dimensional discrete iterated function systems discrete iterated function systems stochastic discrete scale invariance: renormalization representation of discrete sequences with high-dimensional power domains and iterated function systems fractal tilings from iterated function systems...

متن کامل

A Gradient Descent Method for a Neural Fractal Memory

It has been demonstrated that higher order recurrent neural networks exhibit an underlying fractal attractor as an artifact of their dynamics. These fractal attractors o er a very e cent mechanism to encode visual memories in a neural substrate, since even a simple twelve weight network can encode a very large set of di erent images. The main problem in this memory model, which so far has remai...

متن کامل

Logic programs, iterated function systems, and recurrent radial basis function networks

Graphs of the single-step operator for first-order logic programs — displayed in the real plane — exhibit self-similar structures known from topological dynamics, i.e. they appear to be fractals, or more precisely, attractors of iterated function systems. We show that this observation can be made mathematically precise. In particular, we give conditions which ensure that those graphs coincide w...

متن کامل

Fractals in G-Metric Spaces

The theory of iterated function systems (IFS) on complete metric spaces appears in almost all fractal based algorithms used for the purpose of compression of the images and their representation as well. Through a simple mathematical model, IFS technique provides an important tool for description and manipulation of the complex fractal attractors. In this paper we study the iterated function sys...

متن کامل

Manipulation of Non-Linear IFS attractors using Genetic Programming

Non-linear Iterated Function Systems (IFSs) are very powerful mathematical objects related to fractal theory, that can be used in order to generate (or model) very irregular shapes. We investigate in this paper how Genetic Programming techniques can be efficiently exploited in order to generate randomly or interactively artistic “fractal” 2D shapes. Two applications are presented for different ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015